Closed Pattern Mining from n-ary Relations
نویسندگان
چکیده
In this paper, we address the problem of closed pattern mining from n-ary relations. We propose CnS-Miner algorithm which enumerates all the closed patterns of the given n-dimensional dataset in depth first manner satisfying the user specified minimum size constraints. From the given input, the CnS-Miner algorithm generates an n-ary tree and visits the tree in depth first manner. We have proposed a generalized duplicate pruning method which prunes the subtrees that generate duplicate patterns. The space complexity of our algorithm is O(D+d) where D is the n-ary dataset and d is the depth of the tree. We have experimentally compared the proposed algorithm with DataPeeler, a recently proposed algorithm for closed pattern mining from nary relations.
منابع مشابه
Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations
Set pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms which extract frequent closed sets are now available. Generalizing such a task to n-ary relations (n ≥ 2) appears as a timely challenge. It may be important for many applications, e.g., when adding the time dimension to the popular objects × feat...
متن کاملApplication of fundamental relations on n-ary polygroups
The class of $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...
متن کاملConstraint-Based Mining of Closed Patterns in Noisy n-ary Relations. (Fouille Sous Contraintes de Motifs Fermés dans des Relations n-aires Bruitées)
Useful knowledge discovery processes can be based on patterns extracted from large datasets. Designing efficient data mining algorithms to compute collections of relevant patterns is an active research domain. Many datasets record whether some properties hold for some objects, e. g., whether an item is bought by a customer or whether a gene is over-expressed in a biological sample. Such dataset...
متن کاملNo d ’ ordre : 2012 - ISAL - 0094 Année 2012 THÈSE
Pattern discovery in large binary relations has been extensively studied. Typically, it needs to compute patterns that hold in relations Objects×Properties that denote whether given properties are satisfied or not by given objects. An emblematic success in this area concerns frequent itemset mining and its post-processing that derives association rules. It is however clear that many datasets co...
متن کاملDiscovering descriptive rules in relational dynamic graphs
Graph mining methods have become quite popular and a timely challenge is to discover dynamic properties in evolving graphs or networks. We consider the so-called relational dynamic oriented graphs that can be encoded as n-ary relations with n 3 and thus represented by Boolean tensors. Two dimensions are used to encode the graph adjacency matrices and at least one other denotes time. We design t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010